Distributed Methods for Computing Approximate Equilibria
نویسندگان
چکیده
منابع مشابه
Distributed Methods for Computing Approximate Equilibria
We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same time (for example, by solving a single LP that combines the two players payoffs), our algorithm first solves two independent LPs, each of which is derived from one of the two payoff matrices, and then compute approxima...
متن کاملComputing Constrained Approximate Equilibria in Polymatrix Games
This paper is about computing constrained approximate Nash equilibria in polymatrix games, which are succinctly represented manyplayer games defined by an interaction graph between the players. In a recent breakthrough, Rubinstein showed that there exists a small constant ǫ, such that it is PPAD-complete to find an (unconstrained) ǫ-Nash equilibrium of a polymatrix game. In the first part of th...
متن کاملA Graph Spectral Approach for Computing Approximate Nash Equilibria
We present a new methodology for computing approximate Nash equilibria for two-person non-cooperative games based upon certain extensions and specializations of an existing optimization approach previously used for the derivation of fixed approximations for this problem. In particular, the general two-person problem is reduced to an indefinite quadratic programming problem of special structure ...
متن کاملImprecise Minority-Based Full Adder for Approximate Computing Using CNFETs
Nowadays, the portable multimedia electronic devices, which employ signal-processing modules, require power aware structures more than ever. For the applications associating with human senses, approximate arithmetic circuits can be considered to improve performance and power efficiency. On the other hand, scaling has led to some limitations in performance of nanoscale circuits. According...
متن کاملComputing Nash equilibria through computational intelligence methods
Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0465-y